A Pursuit-Evasion BUG Algorithm
نویسندگان
چکیده
We consider the problem of searching for an unpredictable moving target, using a robot that lacks a map of the environment, lacks the ability to construct a map, and has imperfect navigation ability. We present a complete algorithm, which yields a motion strategy for the robot that guarantees the elusive target will be detected, if such a strategy exists. It is assumed that the robot has an omnidirectional sensing device that is used to detect moving targets and also discontinuities in depth data in a 2D environment. We also show that the robot has the same problem-solving power as a robot that has a complete map and perfect navigation abilities. The algorithm has been implemented in simulation, and some examples are shown.
منابع مشابه
Vision-based Detection of Autonomous Vehicles for Pursuit-evasion Games
We present a vision-based algorithm for the detection of multiple autonomous vehicles for a pursuit-evasion game scenario. Our algorithm computes estimates of the pose of multiple moving evaders from visual information collected by multiple moving pursuers, without previous knowledge of the segmentation of the image measurements or the number of moving evaders. We evaluate our algorithm in purs...
متن کاملA Pursuit Strategy for Wheeled-vehicle Formations
Inspired by the so-called “bugs” problem from mathematics, we propose a cyclic pursuit strategy for multivehicle formations. A particular version of this pursuit problem is studied for a system of n wheeled vehicles, each subject to a single nonholonomic constraint, towards the achievement of certain trajectories in the plane. A full stability analysis is provided for the special case when n = ...
متن کاملA Framework for Pursuit Evasion Games in R
We present a framework for solving pursuit evasion games in Rn for the case of N pursuers and a single evader. We give two algorithms that capture the evader in a number of steps linear in the original pursuer-evader distances. We also show how to generalize our results to a convex playing field with finitely many hyperplane boundaries that serve as obstacles.
متن کاملVisibility-Based Pursuit-Evasion with Limited Field of View
We study the visibility-based pursuit-evasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can move arbitrarily fast. Our goal is to develop techniques for coordinating teams of robots to execute this task in application domains such as clearing a building, for reasons of security or safety. To this end,...
متن کاملIncremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
Pursuit-evasion games have been used for modeling various forms of conflict arising between two agents modeled as dynamical systems. Although analytical solutions of some simple pursuit-evasion games are known, most interesting instances can only be solved using numerical methods requiring significant offline computation. In this paper, a novel incremental sampling-based algorithm is presented ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001